Phenomenology of nonlocal cellular automata

Dynamical systems with nonlocal connections have potential applications to economic and biological systems. This paper studies the dynamics of nonlocal cellular automata. In particular, all two-state, three-input nonlocal cellular automata are classified according to the dynamical behavior starting from random initial configurations and random wirings, although it is observed that sometimes a rule can have different dynamical behaviors with different wirings. The nonlocal cellular automata rule space is studied using a mean-field parametrization which is ideal for the situation of random wiring. Nonlocal cellular automata can be considered as computers carrying out computation at the level of each component. Their computational abilities are studied from the point of view of whether they contain many basic logical gates. In particular, I ask the question of whether a three-input cellular automaton rule contains the three fundamental logical gates: two-input rules AND and OR, and one-input rule NOT. A particularly interesting edge-of-chaos nonlocal cellular automaton, the rule 184, is studied in detail. It is a system of coupled selectors or multiplexers. It is also part of the Fredkin's gate—a proposed fundamental gate for conservative computations. This rule exhibits irregular fluctuations of density, large coherent structures, and long transient times.     

A central limit theorem in nonlinear filtering

It is shown that the probability law of a diffusion process conditioned on weakly corrupted observations is asymptotically Gaussian when properly scaled. The method of proof involves Fisher information matrices and a Cramér-Rao inequality.     

Random frog: An efficient reversible jump Markov Chain Monte Carlo-like approach for variable selection with applications to gene selection and disease classification

The identification of disease-relevant genes represents a challenge in microarray-based disease diagnosis where the sample size is often limited. Among established methods, reversible jump Markov Chain Monte Carlo (RJMCMC) methods have proven to be quite promising for variable selection. However, the design and application of an RJMCMC algorithm requires, for example, special criteria for prior distributions. Also, the simulation from joint posterior distributions of models is computationally extensive, and may even be mathematically intractable. These disadvantages may limit the applications of RJMCMC algorithms. Therefore, the development of algorithms that possess the advantages of RJMCMC methods and are also efficient and easy to follow for selecting disease-associated genes is required. Here we report a RJMCMC-like method, called random frog that possesses the advantages of RJMCMC methods and is much easier to implement. Using the colon and the estrogen gene expression datasets, we show that random frog is effective in identifying discriminating genes. The top 2 ranked genes for colon and estrogen are Z50753, U00968, and Y10871_at, Z22536_at, respectively. (The source codes with GNU General Public License Version 2.0 are freely available to non-commercial users at: http://code.google.com/p/randomfrog/.)     

Automatic hierarchy classification in venation networks using directional morphological filtering for hierarchical structure traits extraction

The extraction of vein traits from venation networks is of great significance to the development of a variety of research fields, such as evolutionary biology. However, traditional studies normally target to the extraction of reticulate structure traits (ReSTs), which is not sufficient enough to distinguish the difference between vein orders. For hierarchical structure traits (HiSTs), only a few tools have made attempts with human assistance, and obviously are not practical for large-scale traits extraction. Thus, there is a necessity to develop the method of automated vein hierarchy classification, raising a new challenge yet to be addressed. We propose a novel vein hierarchy classification method based on directional morphological filtering to automatically classify vein orders. Different from traditional methods, our method classify vein orders from highly dense venation networks for the extraction of traits with ecological significance. To the best of our knowledge, this is the first attempt to automatically classify vein hierarchy. To evaluate the performance of our method, we prepare a soybean transmission image dataset (STID) composed of 1200 soybean leaf images and the vein orders of these leaves are manually coarsely annotated by experts as ground truth. We apply our method to classify vein orders of each leaf in the dataset. Compared with ground truth, the proposed method achieves great performance, while the average deviation on major vein is less than 5 pixels and the average completeness on second-order veins reaches 54.28%.     

Global classical solutions to a non-isothermal dynamical ginzburg-landau model in superconductivity

In this paper we propose and study a generalized time dependent Ginzburg-Landau model for superconductivity in which the temperature appears as a variable rather than a parameter. The model is derived by using the general theory of thermodynamics for non-isothermal phase transitions developed by Penrose-Fife and Alt-Pawlow. The global existence of classical solutions of the model is established by using Leray-Schauder fixed point theorem     

Model selection based on Lorenz and concentration curves,Gini indices and convex order

In order to determine an appropriate amount of premium, statistical goodness-of-fit criteria must be supplemented with actuarial ones when assessing performance of a given candidate pure premium. In this paper, concentration curves and Lorenz curves are shown to provide actuaries with effective tools to evaluate whether a premium is appropriate or to compare two competing alternatives. The idea is to compare the premium income for sub-portfolios gathering low risks (identified as low by means of the premiums under consideration) to the true one, or equivalently, to the actual losses. Numerical illustrations performed on hypothetical data and real ones demonstrate the usefulness of the proposed approach.     

Sparse Multicategory Generalized Distance Weighted Discrimination in Ultra-High Dimensions

Distance weighted discrimination (DWD) is an appealing classification method that is capable of overcoming data piling problems in high-dimensional settings. Especially when various sparsity structures are assumed in these settings, variable selection in multicategory classification poses great challenges. In this paper, we propose a multicategory generalized DWD (MgDWD) method that maintains intrinsic variable group structures during selection using a sparse group lasso penalty. Theoretically, we derive minimizer uniqueness for the penalized MgDWD loss function and consistency properties for the proposed classifier. We further develop an efficient algorithm based on the proximal operator to solve the optimization problem. The performance of MgDWD is evaluated using finite sample simulations and miRNA data from an HIV study.     

A combined approach of Kullback–Leibler divergence and background subtraction for moving object detection in thermal video

In this work, a robust method for moving object detection in thermal video frames has been proposed by including Kullback–Leibler divergence (KLD) based threshold and background subtraction (BGS) technique. A trimmed-mean based background model has been developed that is capable enough to reduce noise or dynamic component of the background. This work assumed that each pixel has normally distributed. The KLD has computed between background pixel and a current pixel with the help of Gaussian mixture model. The proposed threshold is useful enough to classify the state of each pixel. The post-processing step uses morphological tool for edge linking, and then the flood-fill algorithm has applied for hole-filling, and finally the silhouette of targeted object has generated. The proposed methods run faster and have validated over various real-time based problematic thermal video sequences. In the experimental results, the average value of F₁-score, area under the curve, the percentage of correct classification, Matthew’s correlation coefficient show higher values whereas total error and percentage of the wrong classification show minimum values. Moreover, the proposed-1 method achieved higher accuracy and execution speed with minimum false alarm rate that has been compared with proposed-2 as well as considered peer methods in the real-time thermal video.     

ABLE: Attention based learning for enzyme classification

Classifying proteins into their respective enzyme class is an interesting question for researchers for a variety of reasons. The open source Protein Data Bank (PDB) contains more than 1,60,000 structures, with more being added everyday. This paper proposes an attention-based bidirectional-LSTM model (ABLE) trained on over sampled data generated by SMOTE to analyse and classify a protein into one of the six enzyme classes or a negative class using only the primary structure of the protein described as a string by the FASTA sequence as an input. We achieve the highest F1-score of 0.834 using our proposed model on a dataset of proteins from the PDB. We baseline our model against eighteen other machine learning and deep learning networks, including CNN, LSTM, Bi-LSTM, GRU, and the state-of-the-art DeepEC model. We conduct experiments with two different oversampling techniques, SMOTE and ADASYN. To corroborate the obtained results, we perform extensive experimentation and statistical testing.